Thue system

英

美

【计】图厄系统

Construction of a finite automaton recognizing the set of irreducible words of the thue system
识别Thue系统不可约字集的有穷自动机的一个构作
A decision method of the completion of a finite commutative special Thue system is given.
给出了判定可交换特殊Thue系统完备化的方法。
A finite commutative special Thue system and its word problem are discussed. It is proved that a finite commutative special Thue system is a product of a finite group and a monoid;
讨论了有限可交换特殊图厄系统（∑∶r）及其字问题，证明了一个有限可交换特殊图厄系统（∑∶r）是一个有限群与一个自由幺半群的直积；
On Finite Commutative Thue System
有限可交换Thue系统
By testing Church-Rosser property of a reduced special Thue system, the completion of system can be decided.
对于所考虑的Thue系统，检验Church-Rosser性质可进行系统完备化判定。
To a finite commutative, special Thue system(Σ: R),(Σ: R) is a finite generated 、 commutative group.
对于一个有限可交换的特殊thue系统（∑：r），证明了（∑：r）是有限生成交换群；